منابع مشابه
Binary Search in Graphs Revisited
In the classical binary search in a path the aim is to detect an unknown target by asking as few queries as possible, where each query reveals the direction to the target. This binary search algorithm has been recently extended by [Emamjomeh-Zadeh et al., STOC, 2016] to the problem of detecting a target in an arbitrary graph. Similarly to the classical case in the path, the algorithm of Emamjom...
متن کاملRestructuring binary search trees revisited
Binary search trees are a fundamental data structure. There are two complexity metrics commonly associated with them: the maximum number of comparisons made during a search and the expected number of comparisons made during a search. Minimizing these metrics, separately or together, has been extensively studied. The difficulty of doing this depends on how much information is given. There are 2n...
متن کاملA binary search problem on graphs
Franzkeit, R., A binary search problem on graphs, Discrete Applied Mathematics 36 (1992) 83-86. Let G = (V, E) be a graph and e’~ E an unknown edge. I:, order to find e’ we choose a sequence of test sets WC V, where aftev every test we are told whether both vertices incident to e’ are in W, or not. For C(Gj, L,,~ Aminimum number of tests required, the inequality c(G)? rlogz 1~11 clearly holds (...
متن کاملGeneralized Binary Search Trees and Clock Trees Revisited
In this paper, we study two diverse problems from a random matrix perspective. The first one is the problem of binary testing (or object/entity identification) that arises in applications such as active learning, fault diagnosis and computer vision, and the second is the problem of zero or bounded skew clock tree construction which arises in applications such as VLSI circuit design and network ...
متن کاملOn the Search Path Length of Random Binary Skip Graphs
In this paper we consider the skip graph data structure, a load balancing alternative to skip lists, designed to perform better in a distributed environment. We extend previous results of Devroye on skip lists, and prove that the maximum length of a search path in a random binary skip graph of size n is of order logn with high probability.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2018
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-0501-y